-
1 recursion lemma
Большой англо-русский и русско-английский словарь > recursion lemma
-
2 recursion lemma
Математика: лемма о рекурсии -
3 recursion lemma
мат. -
4 lemma
-
5 лемма о рекурсии
recursion lemma мат.Русско-английский научно-технический словарь Масловского > лемма о рекурсии
-
6 лемма о рекурсии
Большой англо-русский и русско-английский словарь > лемма о рекурсии
-
7 лемма о рекурсии
Mathematics: recursion lemma
См. также в других словарях:
Lemma von König — Das Lemma von König oder Königslemma ist ein Theorem der Graphentheorie von Dénes Kőnig (1936). Die Berechenbarkeit des Lemmas wurde gründlich in der Mathematischen Logik erforscht. Dénes Kőnig wird korrekterweise mit Doppelakut geschrieben. Das… … Deutsch Wikipedia
König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… … Wikipedia
Zorn's lemma — Zorn s lemma, also known as the Kuratowski Zorn lemma, is a proposition of set theory that states:Every partially ordered set in which every chain (i.e. totally ordered subset) has an upper bound contains at least one maximal element.It is named… … Wikipedia
Diagonal lemma — In mathematical logic, the diagonal lemma or fixed point theorem establishes the existence of self referential sentences in certain formal theories of the natural numbers specifically those theories that are strong enough to represent all… … Wikipedia
Mostowski collapse lemma — In mathematical logic, the Mostowski collapse lemma is a statement in set theory named for Andrzej Mostowski. Contents 1 Statement 2 Generalizations 3 Application 4 Referenc … Wikipedia
List of lemmas — This following is a list of lemmas (or, lemmata , i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also list of axioms, list of theorems and list of conjectures. 0 to 9 *0/1 Sorting Lemma ( comparison… … Wikipedia
Reverse mathematics — is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. The method can briefly be described as going backwards from the theorems to the axioms. This contrasts with the ordinary… … Wikipedia
Red-black tree — A red black tree is a type of self balancing binary search tree, a data structure used in computer science, typically used to implement associative arrays. The original structure was invented in 1972 by Rudolf Bayer who called them symmetric… … Wikipedia
Forcing (mathematics) — For the use of forcing in recursion theory, see Forcing (recursion theory). In the mathematical discipline of set theory, forcing is a technique invented by Paul Cohen for proving consistency and independence results. It was first used, in 1963,… … Wikipedia
List of mathematics articles (R) — NOTOC R R. A. Fisher Lectureship Rabdology Rabin automaton Rabin signature algorithm Rabinovich Fabrikant equations Rabinowitsch trick Racah polynomials Racah W coefficient Racetrack (game) Racks and quandles Radar chart Rademacher complexity… … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia